Allocating a Server to Job Families with Set up Times

نویسندگان

  • Mark P Van Oyen
  • Juta Pichitlamken
چکیده

We consider the problem of allocating a single server to classes of jobs with random service times Each class of jobs possesses a holding cost rate general service distribution and a set up time and designates both a job family and a subtype within the family The set up time is required to e ect a switch from a job of one family to another The objective is to minimize the expected cost due to the waiting of jobs and the switching of the server We partially characterize an optimal policy

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Sequencing with Job Families , Setup Times , and Due

We consider the problem of allocating a single server to families of jobs with random service times and due dates. Furthermore, a setup is required when the server switches from one job family to another. We address the problems of minimizing expected weighted ow time, expected maximum lateness, and total weighted tardiness with emphasis on problems for which it is assumed that each family can ...

متن کامل

Properties of Optimal-Weighted Flowtime Policies with a Makespan Constraint and Set-up Times

We characterize optimal policies for the problem of allocating a single server to a set of jobs from N families. Each job is an instance of demand for an item and is associated with a family, a holding cost rate, and a mean processing time. Setup times are required to switch from one family to another, but not within a family. We consider the case in which the order of jobs within the family is...

متن کامل

GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS

 This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...

متن کامل

Heuristic Approach for Specially Structured Two Stage Flow Shop Scheduling to Minimize the Rental Cost, Processing Time, Set Up Time Are Associated with Their Probabilities Including Transportation Time and Job Weightage

The present paper is an attempt to develop a new heuristic algorithm, find the optimal sequence to minimize the utilization time of the machines and hence their rental cost for two stage specially structured flow shop scheduling under specified rental policy in which processing times and set up time are associated with their respective probabilities including transportation time. Further jo...

متن کامل

A fuzzy multi-objective linear programming approach for solving a new multi-objective job shop scheduling with sequence-dependent setup times

This paper presents a new mathematical model for a bi-objective job shop scheduling problem with sequence-dependent setup times that minimizes the weighted mean completion time and the weighted mean tardiness time. For solving this multi-objective model, we develop a fuzzy multi-objective linear programming (FMOLP) model. In this problem, a proposed FMOLP method is applied with respect to the o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004